Stopping rules and backward error analysis for bound-constrained optimization
نویسندگان
چکیده
Termination criteria for the iterative solution of bound-constrained optimization problems are examined in the light of backward error analysis. It is shown that the problem of determining a suitable perturbation on the problem’s data corresponding to the definition of the backward error is analytically solvable under mild assumptions. Moreover, a link between existing termination criteria and this solution is clarified, indicating that some standard measures of criticality may be interpreted in the sense of backward error analysis. The backward error problem is finally considered from the multicriteria optimization point of view and some numerical illustration is provided.
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملBackward Error Bounds for Constrained Least Squares Problems ∗
We derive an upper bound on the normwise backward error of an approximate solution to the equality constrained least squares problem minBx=d ‖b − Ax‖2. Instead of minimizing over the four perturbations to A, b, B and d, we fix those to B and d and minimize over the remaining two; we obtain an explicit solution of this simplified minimization problem. Our experiments show that backward error bou...
متن کاملSequential Hypothesis Test with Online Usage-Constrained Sensor Selection
This work investigates the sequential hypothesis testing problem with online sensor selection and sensor usage constraints. That is, in a sensor network, the fusion center sequentially acquires samples by selecting one “most informative” sensor at each time until a reliable decision can be made. In particular, the sensor selection is carried out in the online fashion since it depends on all the...
متن کاملConvergence detection for optimization algorithms: Approximate-KKT stopping criterion when Lagrange multipliers are not available
In this paper we investigate how to efficiently apply ApproximateKarush-Kuhn-Tucker (AKKT) proximity measures as stopping criteria for optimization algorithms that do not generate approximations to Lagrange multipliers, in particular, Genetic Algorithms. We prove that for a wide range of constrained optimization problems the KKT error measurement tends to zero. We also develop a simple model to...
متن کاملA Field Guide to Forward-Backward Splitting with a FASTA Implementation
Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond. For highdimensional minimization problems involving large datasets or many unknowns, the forward-backward splitting method (also known as the proximal gradient method) provides a simple, yet practical solver. Despite its apparent simplicity, the performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerische Mathematik
دوره 119 شماره
صفحات -
تاریخ انتشار 2011